On Relating Rewriting Systems and Graph Grammars to Event Structures

In this paper, we investigate how rewriting systems and especially graph grammars as operational models of parallel and distributed systems can be related to event structures as more abstract models. First, distributed rewriting systems that are based on the notion of contexts are introduced as a common framework for diierent kinds of rewriting systems and their parallelism properties are investigated. Then we introduce concrete graph grammars and show how they can be integrated into this framework for rewriting systems. A construction for the Mazurkiewicz trace language related to the derivation sequences of a distributed rewriting system is presented. Since there is a well-known relation between trace languages and event structures, this provides the link between (graph) rewriting and event structures.